Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
p(m, n, s(r)) → p(m, r, n)
p(m, s(n), 0) → p(0, n, m)
p(m, 0, 0) → m
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
p(m, n, s(r)) → p(m, r, n)
p(m, s(n), 0) → p(0, n, m)
p(m, 0, 0) → m
Q is empty.
We use [23] with the following order to prove termination.
Recursive path order with status [2].
Precedence:
trivial
Status:
p3: multiset